#include "include/headers.h"

//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
public:
    int uniquePaths(int m, int n) {
        // dp[i][j]=dp[i-1][j]+dp[i][j-1]
        vector<vector<int>> dp(m, vector<int>(n, 0));
        for (int i = 0; i < m; ++i) {
            for (int j = 0; j < n; ++j) {
                if (i == 0 && j == 0)
                    dp[i][j] = 1;
                else if (i == 0 && j > 0)
                    dp[i][j] = dp[i][j - 1];
                else if (j ==0 && i > 0)
                    dp[i][j] = dp[i - 1][j];
                else
                    dp[i][j] = dp[i-1][j] + dp[i][j-1];
            }
        }
        return dp[m -1][n - 1];
    }
};
//leetcode submit region end(Prohibit modification and deletion)
